On Integer Sequences Associated With the Cyclic and Complete Graphs
نویسنده
چکیده
We study integer sequences associated with the cyclic graph Cr and the complete graph Kr. Fourier techniques are used to characterize the sequences that count walks of length n on both these families of graphs. In the case of the cyclic graph, we show that these sequences are associated with an induced colouring of Pascal’s triangle. This extends previous results concerning the Jacobsthal numbers.
منابع مشابه
Associated Graphs of Modules Over Commutative Rings
Let $R$ be a commutative ring with identity and let $M$ be an $R$-module. In this paper we introduce a new graph associated to modules over commutative rings. We study the relationship between the algebraic properties of modules and their associated graphs. A topological characterization for the completeness of the special subgraphs is presented. Also modules whose associated graph is complete...
متن کاملTotal vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملInteger sequences from walks in graphs
We define numbers of the type Oj(N) = N – N + N – ... + N and E(N) = –N + N – N + ... + N (j = 0, 1, 2, ...) and the corresponding integer sequences. We prove that these integer sequences, e.g., S0(N) = O0(N), O1(N), ..., Or(N), ... and SE(N) = E0(N), E1(N), ..., Er(N), ... correspond to the number of odd and even walks in complete graphs KN. We then prove that there is a unique family of graph...
متن کاملNon-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007